Categorial Grammars for Strata of Non-CF Languages and their Parsers
نویسندگان
چکیده
We introduce a generalization of oategorial grammar extending its descriptive power~ and a simple model of oategorial gram.at parser. ~oth tools 08/% be adjusted to particular strata of languages via restricting gralmnatieal or computational complexity'. I. .Two questions about oategprial 6]ra3,1ars In. spite of the fascinating folnnal simplicity 8/Id lucidity of oategorial grammar as developed by Bar-Hillel [I] q~Eunbek [7] and followers, it has nevertheless never been brou~'ht into wide scale use. Why' is this so? We may' easily' recognize two draw-
منابع مشابه
On Commutative and Nonassociative Syntactic Calculi and Categorial Grammars
Two axiomatizations of the nonassociative and commutative Lambek syntactic calculus are given and their equivalence is proved. The rst axiomatization employs Permutation as the only structural rule, the second one, with no Permutation rule, employs only unidirectional types. It is also shown that in the case of the Aj-dukiewicz calculus an analogous equivalence is valid only in the case of a re...
متن کاملS4 enriched multimodal categorial grammars are context-free
Bar-Hillel et al. [1] prove that applicative categorial grammars weakly recognize the context-free languages. Buszkowski [2] proves that grammars based on the product-free fragment of the non-associative Lambek calculus NL recognize exactly the contextfree languages. Kandulski [7] furthers this result by proving that grammars based on NL also recognize exactly the context-free languages. Jäger ...
متن کاملNon-deterministic Recursive Ascent Parsing
A purely functional implementation of LR-parsers is given, together with a simple correctness proof. It is presented as a generalization of the recursive descent parser. For non-LR grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. Memo-functions also...
متن کاملIterated Dependencies and Kleene Iteration
Categorial Dependency Grammars (CDG) is a class of simple and expressive categorial grammars defining projective and discontinuous dependency structures in a strongly compositional way. They are more expressive than CF-grammars, are polynomial time recognizable and different from the mildly context sensitive grammars. CDG languages are proved to be closed under all AFL operations, but iteration...
متن کاملCombinatory Categorial Grammars: Generative Power and Relationship to Linear Context-Free Rewriting Systems
Recent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammm~, Head Grammars, and Linear Indexed Grammars. In this paper we show that Combinatory Categorial Grammars also generates the same class of languages. We discuss the slruclm'al descriptions produced by Combi...
متن کامل